Controlling centrality in complex networks

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Controlling centrality in complex networks

Dipartimento di Fisica ed Astronomia, Università di Catania, and INFN Sezione di Catania, 95123, Catania, Italy, Laboratorio sui Sistemi Complessi, Scuola Superiore di Catania, Università di Catania, 95123, Catania, Italy, Departamento de Matemática Aplicada, Universidad Rey Juan Carlos, 28933, Madrid, Spain, Dipartimento di Matematica e Informatica, Università di Catania, Via S., Sofia, 64, 95...

متن کامل

Subgraph centrality in complex networks.

We introduce a new centrality measure that characterizes the participation of each node in all subgraphs in a network. Smaller subgraphs are given more weight than larger ones, which makes this measure appropriate for characterizing network motifs. We show that the subgraph centrality [C(S)(i)] can be obtained mathematically from the spectra of the adjacency matrix of the network. This measure ...

متن کامل

From centrality to temporary fame: Dynamic centrality in complex networks

We develop a new approach to the study of the dynamics of link utilization in complex networks using records of communication in a large social network. Counter to the perspective that nodes have particular roles, we find roles change dramatically from day to day. “Local hubs” have a power law degree distribution over time, with no characteristic degree value. Our results imply a significant re...

متن کامل

Temporal node centrality in complex networks.

Many networks are dynamic in that their topology changes rapidly--on the same time scale as the communications of interest between network nodes. Examples are the human contact networks involved in the transmission of disease, ad hoc radio networks between moving vehicles, and the transactions between principals in a market. While we have good models of static networks, so far these have been l...

متن کامل

Comment on "Subgraph centrality in complex networks".

We disprove a conjecture of Estrada and Rodríguez-Velázquez [Phys. Rev. E 71, 056103 (2005)] that if a graph has identical subgraph centrality for all nodes, then the closeness and betweenness centralities are also identical for all nodes.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Scientific Reports

سال: 2012

ISSN: 2045-2322

DOI: 10.1038/srep00218